Achievable rate region based on coset codes for multiple access channel with states
نویسندگان
چکیده
We derive a new achievable rate region for the problem of communicating over a multiple access channel with states. Our coding technique is based on the ensemble of nested coset codes and the technique of typicality decoding. Exploiting structure in this ensemble, we analyze a more efficient decoding strategy to improve upon the rate region achievable using unstructured codes. We identify examples for which the achievable rate region based on nested coset codes is strictly larger than the ones achievable using random unstructured codes.
منابع مشابه
On the Achievable Rate-Regions for the Gaussian Two-way Diamond Channels
In this channel,we study rate region of a Gaussian two-way diamond channel which operates in half-duplex mode. In this channel, two transceiver (TR) nodes exchange their messages with the help of two relay nodes. We consider a special case of the Gaussian two-way diamond channels which is called Compute-and-Forward Multiple Access Channel (CF-MAC). In the CF-MAC, the TR nodes transmit their mes...
متن کاملExtension of the Coverage Region of Multiple Access Channels by Using a Relay
From practical and theoretical viewpoints, performance analysis of communication systems by using information-theoretic results is important. In this paper, based on our previous work on Multiple Access Channel (MAC) and Multiple Access Relay Channel (MARC), we analyze the impact of a relay on the fundamental wireless communications concept, i.e., coverage region of MARC, as a basic model for u...
متن کاملA new coding theorem for three user discrete memoryless broadcast channel
We propose a new coding technique based on nested coset codes and derive a new achievable rate region for a general three user discrete memoryless broadcast channel (DMBC). We identify an example of a three user binary broadcast channel for which the proposed achievable rate region strictly outperforms that obtained by a natural extension of Marton’s [1] rate region. As a step towards deriving ...
متن کاملAchievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel
In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...
متن کاملAn achievable rate region for the multiple-access channel with feedback
An achievable rate region R , G I( X, ; Y 1 X,, U), R 2 G 1(X2; YIX,, U), RI + R2 G 4x1, X2; Y), where P(U, xl, XZ, Y) = p(u)p(x,~u)p(x~~u)p(ylxl,x~), is established for the multiple-access channel with feedback. Time sharing of these achievable rates yields the rate region of this paper. This region generally exceeds the achievable rate region without feedback and exceeds the rate point found ...
متن کامل